Invariant boundary distributions for finite graphs
نویسنده
چکیده
Let G be a finite connected graph, and let ∆ be its universal covering tree. The edges of ∆ are directed and each geometric edge corresponds to two directed edges δ and δ. Let ∆ be the set of vertices and ∆ the set of directed edges of ∆. The boundary ∂∆ is the set of equivalence classes of infinite semi-geodesics in ∆, where two semi-geodesics are equivalent if they agree except on finitely many edges. The boundary has a natural compact totally disconnected topology. The fundamental group Γ of G is a free group which acts on ∆ and on ∂∆. If M is an abelian group then an M-valued distribution on ∂∆ is a finitely additive M-valued measure μ defined on the clopen subsets of ∂∆. By integration, a distribution may be regarded as an M-linear function on the group C(∂∆,M) of locally constant M-valued functions on ∂∆. Let D(∂∆,M) be the additive group of all Γ-invariant M-valued distributions on ∂∆ and let
منابع مشابه
Twist Maps and Aubry-Mather Sets
For an area-preserving twist map F of a finite annulus, we obtain “quasi-foliations” of the annulus by one-sided-F -invariant graphs of functions that are either continuous (in which case the graph is a fully invariant curve) or have countably many jump discontinuities. For each of the one-sided-invariant graphs there is a well defined (one-sided) rotation number and all the numbers between the...
متن کاملUnimodular random trees
We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to give a new proof that URTs are sofic, a result of Elek. We show that ends of invariant forests in the hyperbolic plane converge to ideal boundary points. We...
متن کاملBounds for the annealed return probability on large finite percolation graphs ∗
Bounds for the expected return probability of the delayed random walk on finite clusters of an invariant percolation on transitive unimodular graphs are derived. They are particularly suited for the case of critical Bernoulli percolation and the associated heavy-tailed cluster size distributions. The upper bound relies on the fact that cartesian products of finite graphs with cycles of a certai...
متن کاملDeterminants of Adjacency Matrices of Graphs
Let G be a simple graph with finite number of vertices. We denote by det(G) the determinant of an adjacency matrix of G. This number det(G) is an integer and is an invariant of G so that its value is independent of the choice of vertices in an adjacency matrix. In this paper, we study the distributions of det(G) whenever G runs over graphs with finite n vertices for a given integer n ≥ 1. We de...
متن کاملStatic Analysis of Orthotropic Functionally Graded Material Cylinders with Finite Length by a Mesh-Free Method
In this paper static analysis of orthotropic functionally graded material (FGM) cylinders with finite length was carried out by a mesh-free method. MLS shape functions are used for approximation of displacement field in the weak form of equilibrium equation and essential boundary conditions are imposed by transformation method. In this simulation, an ax symmetric model is used. Mechanical prope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 115 شماره
صفحات -
تاریخ انتشار 2008